Probabilistic Game Automata
نویسندگان
چکیده
We define a probabilistic game automaton, a general model of a two-person game. We show how this model includes as special cases the games against nature of Papadimitriou [13], the Arthur-Merlin games of Babai [ 11, and the interactive proof systems of Goldwasser, Micah, and Rackoff [7]. We prove a number of results about another special case, games against unknown nature, which is a generalization of games against nature. In our notation, we let UP, (K) denote the class of two-person games with unbounded two-sided error where one player plays randomly, with partial information (complete information). Hence, the designation UC refers to games against known nature and UP refers to games against unknown nature. We show that
منابع مشابه
Algorithmic probabilistic game semantics - Playing games with automata
We present a detailed account of a translation from probabilistic call-by-value programs with procedures to Rabin’s probabilistic automata. The translation is fully abstract in that programs exhibit the same computational behaviour if and only if the corresponding automata are language-equivalent. Since probabilistic language equivalence is decidable, we can apply the translation to analyse the...
متن کاملGAME OF COORDINATION FOR BACTERIAL PATTERN FORMATION: A FINITE AUTOMATA MODELLING
In this paper, we use game theory to describe the emergence of self-organization and consequent pattern formation through communicative cooperation in Bacillus subtilis colonies. The emergence of cooperative regime is modelled as an n-player Assurance game, with the bacterial colonies as individual players. The game is played iteratively through cooperative communication, and mediated by exchan...
متن کاملKullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata
We consider the problem of computing the Kullback-Leibler distance, also called the relative entropy, between a probabilistic context-free grammar and a probabilistic finite automaton. We show that there is a closed-form (analytical) solution for one part of the Kullback-Leibler distance, viz. the cross-entropy. We discuss several applications of the result to the problem of distributional appr...
متن کاملFinite-state abstractions for probabilistic computation tree logic
Probabilistic Computation Tree Logic (PCTL) is the established temporal logic for probabilistic verification of discrete-time Markov chains. Probabilistic model checking is a technique that verifies or refutes whether a property specified in this logic holds in a Markov chain. But Markov chains are often infinite or too large for this technique to apply. A standard solution to this problem is t...
متن کاملTraining artificial neural networks to learn a nondeterministic game
It is well known that artificial neural networks (ANNs) can learn deterministic automata. Learning nondeterministic automata is another matter. This is important because much of the world is nondeterministic, taking the form of unpredictable or probabilistic events that must be acted upon. If ANNs are to engage such phenomena, then they must be able to learn how to deal with nondeterminism. In ...
متن کاملModal Stochastic Games
This paper presents an abstraction-refinement framework for Segala’s probabilistic automata (PA), a slight variant of Markov decision processes. We use Condon and Ladner’s two-player probabilistic game automata extended with possible and required transitions — as in Larsen and Thomsen’s modal transition systems — as abstract models. The key idea is to refine player-one and player-two states sep...
متن کامل